Decoding of linear codes for single error bursts correction based on the determination of certain events

Introduction: In modern systems for communication, data storage and processing the error-correction capability of codes are estimated memoryless channels. real channels noise is correlated, which leads to grouping error in bursts. A traditional method fight this phenomenon channel decorrelation, does not allow developing coding schemes, mostly utilizing capacity. Thus development bursts decoding algorithms arbitrary linear actual task. Purpose: To develop a single burst algorithm codes, estimate probability computational complexity. Results: Two approaches proposed correction. The first one based on combining window sliding modification well-known bit-flipping with preliminary analysis structure parity check matrix. second recursive procedure constructing sequence certain events which, worst case, performs exhaustive search bursts, but many cases may be significantly decreased by using heuristics. allows guaranteed correction any within burst-correction code, beyond capability. complexity lower than that bit flipping if parity-check matrix code sparse enough. An alternative hybrid approach showing completion time comparable algorithm, however, case possibility hardly can proved. Practical relevance: methods used perspective communication systems, allowing energy saving increasing reliability transmission better performance